On Edge-Colored Graphs Covered by Properly Colored Cycles
نویسندگان
چکیده
We characterize edge-colored graphs in which every edge belongs to some properly colored cycle. We obtain our result by applying a characterization of 1-extendable graphs.
منابع مشابه
Cycles and paths in edge-colored graphs with given degrees
Sufficient degree conditions for the existence of properly edge-colored cycles and paths in edge-colored graphs, multigraphs and random graphs are inverstigated. In particular, we prove that an edgecolored multigraph of order n on at least three colors and with minimum colored degree greater than or equal to d 2 e has properly edge-colored cycles of all possible lengths, including hamiltonian c...
متن کاملMaximum colored trees in edge-colored graphs
Abstract We consider maximum properly edge-colored trees in edge-colored graphs Gc. We also consider the problem where, given a vertex r, determine whether the graph has a spanning tree rooted at r, such that all root-to-leaf paths are properly colored. We consider these problems from graphtheoretic as well as algorithmic viewpoints. We prove their optimization versions to be NP-hard in general...
متن کاملNote on edge-colored graphs and digraphs without properly colored cycles
We study the following two functions: d(n, c) and ~ d(n, c); d(n, c) (~ d(n, c)) is the minimum number k such that every c-edge-colored undirected (directed) graph of order n and minimum monochromatic degree (out-degree) at least k has a properly colored cycle. Abouelaoualim et al. (2007) stated a conjecture which implies that d(n, c) = 1. Using a recursive construction of c-edge-colored graphs...
متن کاملCharacterization of edge-colored complete graphs with properly colored Hamilton paths
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph G has a properly colored Hamilton path if and only if G has a spanning subgraph consisting of a properly colored path C0 and a (possibly empty) collection of properly colored cycles C1, C2, . . . , Cd such that V (Ci) ...
متن کاملPartitioning 2-edge-colored graphs by monochromatic paths and cycles
We present results on partitioning the vertices of 2-edge-colored graphs into monochromatic paths and cycles. We prove asymptotically the two-color case of a conjecture of Sárközy: the vertex set of every 2-edge-colored graph can be partitioned into at most 2α(G) monochromatic cycles, where α(G) denotes the independence number of G. Another direction, emerged recently from a conjecture of Schel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Graphs and Combinatorics
دوره 21 شماره
صفحات -
تاریخ انتشار 2005